Pólya Urns with Immigration at Random Times

نویسندگان

  • Erol Peköz
  • Adrian Röllin
چکیده

We study the number of white balls in a classical Pólya urn model with the additional feature that, at random times, a black ball is added to the urn. The number of draws between these random times are i.i.d. and, under certain moment conditions on the inter-arrival distribution, we characterize the limiting distribution of the (properly scaled) number of white balls as the number of draws goes to infinity. The possible limiting distributions obtained in this way vary considerably depending on the interarrival distribution and are difficult to describe explicitly. However, we show that the limits are fixed points of certain probabilistic distributional transformations, and this fact provides a proof of convergence and leads to properties of the limits. The model can alternatively be viewed as a preferential attachment random graph model where added vertices initially have a random number of edges, and from this perspective, our results describe the limit of the degree of a fixed vertex.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classification of large Pólya-Eggenberger urns with regard to their asymptotics

This article deals with Pólya generalized urn models with constant balance in any dimension. It is based on the algebraic approach of Pouyanne (2005) and classifies urns having “large” eigenvalues in five classes, depending on their almost sure asymptotics. These classes are described in terms of the spectrum of the urn’s replacement matrix and examples of each case are treated. We study the ca...

متن کامل

Functional Limit Theorems for Multitype Branching Processes and Generalized Pólya Urns

A functional limit theorem is proved for multitype continuous time Markov branching processes. As consequences, we obtain limit theorems for the branching process stopped by some stopping rule, for example when the total number of particles reaches a given level. Using the Athreya–Karlin embedding, these results yield asymptotic results for generalized Pólya urns. We investigate such results in...

متن کامل

Necklace Processes via Pólya Urns

Mallows and Shepp (2008) developed the following necklace processes. Start with a necklace consisting of one white bead and one black bead, and insert, one at a time, under a deterministic rule, a white bead or a black bead between a randomly chosen adjacent pair. They studied the statistical properties of the number of white beads by investigating the nature of the moments and the expected num...

متن کامل

Asymptotic Properties of Multicolor Randomly Reinforced Pólya Urns

The generalized Pólya urn has been extensively studied and is widely applied in many disciplines. An important application of urn models is in the development of randomized treatment allocation schemes in clinical studies. The randomly reinforced urn was recently proposed, but, although the model has some intuitively desirable properties, it lacks theoretical justification. In this paper we obt...

متن کامل

On The Distribution Of The Number Of Missing Words In Random Texts

Determining the distribution of the number of empty urns after a number of balls have been thrown randomly into the urns is a classical and well understood problem. We study a generalization: Given a finite alphabet of size σ and a word length q, what is the distribution of the number X of words (of length q) that do not occur in a random text of length n+q−1 over the given alphabet? For q = 1,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017